منابع مشابه
Some Results about Set-Valued Complementarity Problem
This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...
متن کاملSome Results About Frames
In this paper we discuss some topics related to the general theory of frames. In particular we focus our attention to the existence of different ’reconstruction formulas’ for a given vector of a certain Hilbert space and to some refinement of the perturbative approach for the computation of the dual frame.
متن کاملSome Exact Results And New Asymptotics For Hypergraph Turán Numbers
Given a family F of r-graphs, let ex(n,F) be the maximum number of edges in an n vertex r-graph containing no member of F . Let C 4 denote the family of r-graphs with distinct edges A,B, C, D, such that A ∩ B = C ∩ D = ∅, A ∪ B = C ∪ D. For s1 ≤ · · · ≤ sr, let K(s1, . . . , sr) be the complete r-partite r-graph with parts of sizes s1, . . . , sr. Füredi conjectured over 15 years ago that ex(n,...
متن کاملSome results about unbounded convergences in Banach lattices
Suppose E is a Banach lattice. A net in E is said to be unbounded absolute weak convergent ( uaw-convergent, for short) to provided that the net convergences to zero, weakly. In this note, we further investigate unbounded absolute weak convergence in E. We show that this convergence is stable under passing to and from ideals and sublattices. Compatible with un-convergenc, we show that ...
متن کاملResults on hypergraph planarity
Using the notion of planarity and drawing for hypergraphs introduced respectively by Johnson and Pollak [9] and Mäkinen [14], we show in this paper that any hypergraph having less than nine hyperedges is vertex-planar and can be drawn in the edge standard and in the subset standard without edge crossing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2016
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/13/2/7986